Fusion Schemes of Semidirect Products of Association Schemes
نویسندگان
چکیده
Let X = (X, H) and Y = (Y, K) be two association schemes. In [1], an (external) semidirect product Z = (X × Y, H nπ K) of Y and X relative to π is defined. In this paper, given a normal closed subset N of K which is fixed by π, we find a way to construct a fusion scheme of Z with respect to N . We then show that every association scheme obtained by any of three products, direct, wreath and semidirect product, of X = (X, H) and Y = (Y, K), is realized as a fusion scheme of Z relative to a proper π with respect to a suitable normal closed subset N of K. Finally, we give some examples of the fusion schemes of Z with respect to a certain N , which are not decomposed into their subschemes via any of the three product operations.
منابع مشابه
On generalized semidirect product of association schemes
In this paper, we introduce a new product operation of association schemes in order to generalize the notion of semidirect products and wreath product. We then show that our construction covers some association schemes which are neither wreath products nor semidirect products of two given association schemes.
متن کاملSemidirect Products of Association Schemes
In his 1996 work developing the theory of association schemes as a ‘generalized’ group theory, Zieschang introduced the concept of the semidirect product as a possible product operation of certain association schemes. In this paper we extend the semidirect product operation into the entire set of association schemes. We then derive a way to decompose certain association schemes into smaller ass...
متن کاملCombination of Feature Selection and Learning Methods for IoT Data Fusion
In this paper, we propose five data fusion schemes for the Internet of Things (IoT) scenario,which are Relief and Perceptron (Re-P), Relief and Genetic Algorithm Particle Swarm Optimization (Re-GAPSO), Genetic Algorithm and Artificial Neural Network (GA-ANN), Rough and Perceptron (Ro-P)and Rough and GAPSO (Ro-GAPSO). All the schemes consist of four stages, including preprocessingthe data set ba...
متن کاملNew Shewhart-type synthetic bar{X} control schemes for non-normal data
In this paper, Burr-type XII ̄X synthetic schemes are proposed as an alternative to the classical ̄X synthetic schemes when the assumption of normality fails to hold. First, the basic design of the Burr-type XII ̄X synthetic scheme is developed and its performance investigated using exact formulae. Secondly, the non-side-sensitive and side-sensitive Burr-type XII ̄X synthetic schemes are int...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کامل